Faster Implementation of Ideal Lattice-based Cryptography Using AVX512

نویسندگان

چکیده

With the development of quantum computing, existing cryptography schemes based on classical cryptographic primitives will no longer be secure. Hence, cryptographers are designing post-quantum (PQC) schemes, and ideal lattice-based has emerged as a prime candidate. Today, becomes more mature, its performance an important optimization goal. In cryptography, polynomial arithmetic sampling most time-consuming operations therefore need to accelerated. this paper, taking advantage parallelism new 512-bit advanced vector instructions (AVX512), we present parallel implementations sampling, thus comprehensively improving their performance. We conduct experiments with Dilithium scheme(one scheme NIST PQC Standardization Process Round-4). Our implementation gets nice boost compared pure C language 256-bit (AVX2) implementation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography

The Number Theoretic Transform (NTT) provides efficient algorithms for cyclic and nega-cyclic convolutions, which have many applications in computer arithmetic, e.g., for multiplying large integers and large degree polynomials. It is commonly used in cryptographic schemes that are based on the hardness of the Ring Learning With Errors (R-LWE) problem to efficiently implement modular polynomial ...

متن کامل

Improvement of Lattice-Based Cryptography Using CRT

In this paper, we first critically analyze two existing latticebased cryptosystems, namely GGH and Micciancio, and identify their drawbacks. Then, we introduce a method for improving the implementation of GGH using the Chinese Remainder Theorem (CRT). Furthermore, we also propose another cryptosystem optimized for CRT, drawing on the strengths of both cryptosystems. We provide a fair comparison...

متن کامل

Lattice-Based Cryptography

In this chapter we describe some of the recent progress in lattice-based cryptography. Lattice-based cryptographic constructions hold a great promise for post-quantum cryptography, as they enjoy very strong security proofs based on worst-case hardness, relatively efficient implementations, as well as great simplicity. In addition, lattice-based cryptography is believed to be secure against quan...

متن کامل

Lattice Based Cryptography for Beginners

The purpose of this lecture note is to introduce lattice based cryptography, which is thought to be a cryptosystem of post-quantum age. We have tried to give as many details possible specially for novice on the subject. Something may be trivial to an expert but not to a novice. Many fundamental problems about lattice are thought to be hard even against quantum computer, compared to factorizatio...

متن کامل

Towards practical lattice-based cryptography

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions in Embedded Computing Systems

سال: 2023

ISSN: ['1539-9087', '1558-3465']

DOI: https://doi.org/10.1145/3609223